#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <set>
#include <limits.h>
#include "tree.h"

using namespace std;


/* from bottom to top */
void levelPrint(Tree *root)
{
    vector<vector<Tree *> > myStack;
    vector<Tree *> cur, next;
    cur.push_back(root);
    while (!cur.empty()) {
	myStack.push_back(cur);
	for (int i = 0; i < cur.size(); i++) {
	    if (cur[i]->left) next.push_back(cur[i]->left);
	    if (cur[i]->right) next.push_back(cur[i]->right);
	}		
	cur = next;
	next.clear();	
    }
    for (int i = myStack.size()-1; i >= 0; i--) {
	for (int j = 0; j < myStack[i].size(); j++) 
	    cout << myStack[i][j]->data << " ";
	cout << endl;
    }
}

int main(int argc, char **argv)
{
    int input[] = {21,7,5,6,3,2,1,4,6,23,43,54,12,54,8,10,11,35,56};
    //int input[] = {7};
    Tree *root = NULL, *root2 = NULL;
    vector<int> preOrder;
    int result;

    for (int i = 0; i < sizeof(input)/sizeof(int); i++) {
        TreeInsert(root, input[i]);
    }
    print_ascii_tree(root);
    levelPrint(root);
}
